Impact of OpenMP Optimizations for the MGCG Method

نویسندگان

  • Osamu Tatebe
  • Mitsuhisa Sato
  • Satoshi Sekiguchi
چکیده

This paper shows several optimization techniques in OpenMP and investigates their impact using the MGCG method. MGCG is important for not only an e cient solver but also benchmarking since it includes several essential operations for high-performance computing. We evaluate several optimizing techniques on an SGI Origin 2000 using the SGI MIPSpro compiler and the RWCP Omni OpenMP compiler. In the case of the RWCP Omni OpenMP compiler, the optimization greatly improves performance, whereas for the SGI MIPSpro compiler, it does not a ect very much though the optimized version scales well up to 16 processors with a larger problem. This impact is examined by a light-weight pro ling tool bundled with the Omni compiler. We propose several new directives for further performance and portability of OpenMP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ecient Implementation of the Multigrid Preconditioned Conjugate Gradient Method on Distributed Memory Machines

A multigrid preconditioned conjugate gradient (MGCG) method[15], which uses the multigrid method as a preconditioner for the CG method, has a good convergence rate even for the problems on which the standard multigrid method does not converge efciently. This paper considers a parallelization of the MGCG method and proposes an e cient parallel MGCG method on distributed memory machines. For the ...

متن کامل

Parallel Data Flow Analysis for OpenMP Programs

The paper presents a compiler framework for analyzing and optimizing OpenMP programs. The framework includes Parallel Control Flow Graph and Parallel Data Flow equations based on the OpenMP relaxed memory consistency model. It enables traditional compiler analyses as well as specific optimizations for OpenMP. Based on the framework, we describe dead code elimination and barrier elimination algo...

متن کامل

cient Implementation of the Multigrid Preconditioned Conjugate Gradient Method on Distributed Memory

A multigrid preconditioned conjugate gradient (MGCG) method[15], which uses the multigrid method as a preconditioner for the CG method, has a good convergence rate even for the problems on which the standard multigrid method does not converge efciently. This paper considers a parallelization of the MGCG method and proposes an e cient parallel MGCG method on distributed memory machines. For the ...

متن کامل

Extending Global Optimizations in the OpenUH Compiler for OpenMP

This paper presents our design and implementation of a framework for analyzing and optimizing OpenMP programs within the OpenUH compiler, which is based on Open64. The paper describes the existing analyses and optimizations in OpenUH, and explains why the compiler may not apply classical optimizations to OpenMP programs directly. It then presents an enhanced compiler framework including Paralle...

متن کامل

Algorithmic optimizations of a conjugate gradient solver on shared memory architectures

OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and powerful in terms of programming abstractions. Unfortunately, the architecture-independent abstractions sometimes come with the price of low parallel performance. This is especially true for applications with unstructured data access pattern running on distributed share...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000